منابع مشابه
Robust Quadratic Assignment Problem with Uncertain Locations
We consider a generalization of the classical quadratic assignment problem, where coordinates of locations are uncertain and only upper and lower bounds are known for each coordinate. We develop a mixed integer linear programming model as a robust counterpart of the proposed uncertain model. A key challenge is that, since the uncertain model involves nonlinear objective function of the ...
متن کاملThe quadratic assignment polytope
We study the quadratic assignment problem (with n variables) from a polyhedral point of view by considering the quadratic assignment polytope that is defined as the convex hull of the solutions of the linearized problem (with n + 2 n 2 n −1 ( ) variables). We give the dimension of the polytope and a minimal description of its affine hull. We also propose a family of facets with a separation alg...
متن کاملSolving Quadratic Assignment Problems
We describe a branch-and-bound algorithm for the quadratic assignment problem (QAP) that uses a convex quadratic programming (QP) relaxation to obtain a bound at each node. The QP subproblems are approximately solved using the Frank-Wolfe algorithm, which in this case requires the solution of a linear assignment problem on each iteration. Our branching strategy makes extensive use of dual infor...
متن کاملSemi Quadratic Assignment Problem
Changing the QAP's hard definition such that the facilities M are allowed to be mapped by a (single-valued, not necessarily injective) function π into the set of possible locations Y subject to a relation Π, π ⊆ Π, it arises the Semi-QAP that might be regarded as a relaxation of the QAP. In contrast to the Tree-QAP (flow graph F is a tree) the corresponding Semi-Tree-QAP is solvable in polynomi...
متن کامل2 The Quadratic Assignment
These last years a new model of cooperative algorithm appeared , the model of ants colonies. This paper is dedicated to the integration of an ants colony's based cooperation method, in another algorithm, here research tabu, opposite the rough use of the computing power placed at the disposal on the current networks. The algorithms that we present are applied to the resolution of quadratic assig...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the Japan Society of Civil Engineers
سال: 1969
ISSN: 1884-4936,0385-5392
DOI: 10.2208/jscej1969.1969.167_23